Complete lattice
PARTIALLY ORDERED SET IN WHICH ALL SUBSETS HAVE BOTH A SUPREMUM AND INFIMUM
Complete lattices; Complete free lattice; Complete homomorphism; Complete lattice homomorphism; Locally finite complete lattice
In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). A lattice which satisfies at least one of these properties is known as a conditionally complete lattice.